package bin_tree;

import bin_tree.MaxHeap.MaxHeap;
import bin_tree.MinHeap.MinHeap;

import javax.naming.PartialResultException;
import java.util.Arrays;

public class HeapTest {
    public static void main(String[] args) {
        int arr[] = {15,17,19,13,22,16,28,30,41,62};
        MinHeap Heap = new MinHeap(arr);
//        for (int i : arr) {
//            Heap.add(i);
//        }
////        Heap.add(52);
//        for (int i = 0; i < arr.length; i++) {
//            arr[i] = Heap.extractMin();
//        }

        System.out.println(Heap);
    }
}
